Formally Verified Animation for RoboChart Using Interaction Trees

نویسندگان

چکیده

RoboChart is a core notation in the RoboStar framework. It timed and probabilistic domain-specific state machine based language for robotics. supports shared variables communication across entities its component model. has formal denotational semantics given CSP. Interaction Trees (ITrees) semantic technique to represent behaviours of reactive concurrent programs interacting with their environments. Recent mechanisations ITrees along ITree-based CSP Z mathematical toolkit Isabelle/HOL bring new applications verification animation state-rich process languages, such as RoboChart. In this paper, we use give novel operational semantics, implement it Isabelle, Isabelle’s code generator generate verified executable animations. We illustrate our approach using an autonomous chemical detector With animation, show two concrete scenarios when robot encounters different environmental inputs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formally Verified Modular Semantics

This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm surge barrier near the city of Rotterdam in the Netherlands. BOS was specified in the formal language Z and model checking has been applied to some of its subsystems during its development. A lightweigh...

متن کامل

Formally Verified System Initialisation

The safety and security of software systems depends on how they are initially configured. Manually writing program code that establishes such an initial configuration is a tedious and error-prone engineering process. In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. The construction principles of th...

متن کامل

Formally Verified On-Line Diagnosis

A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...

متن کامل

A Formally Verified Mechanism for Countering SPIT

Voice over IP (VoIP) is a key technology, which provides new ways of communication. It enables the transmission of telephone calls over the Internet, which delivers economical telephony that can clearly benefit both consumers and businesses, but it also provides a cheap method of mass advertising. Those bulks unsolicited calls are known as SPam over Internet Telephony (SPIT). In this paper we i...

متن کامل

A Formally-Verified Alias Analysis

This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-17244-1_24